List-coloring graphs without K4, k-minors
نویسنده
چکیده
In this note, it is shown that every graph with no K4,k-minor is 4k-list-colorable. We also give an extremal function for the existence for a K4,k-minor. Our proof implies that there is a linear time algorithm for showing that either G has a K4,k-minor or G is 4k-choosable. In fact, if the latter holds, then the algorithm gives rise to a 4k-list-coloring. © 2008 Elsevier B.V. All rights reserved.
منابع مشابه
-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملList-chromatic Number and the Chromatic Number in Minor-closed and Odd-minor-closed Classes of Graphs
It is well-known (Feige and Kilian [24], H̊astad [39]) that approximating the chromatic number within a factor of n1−ε cannot be done in polynomial time for ε > 0, unless coRP = NP. Computing the list-chromatic number is much harder than determining the chromatic number. It is known that the problem of deciding if the list-chromatic number is k, where k ≥ 3, is Πp2-complete [37]. In this paper, ...
متن کاملPrecoloring extension for K4-minor-free graphs
Let G = (V, E) be a graph where every vertex v ∈ V is assigned a list of available colors L(v). We say that G is list colorable for a given list assignment if we can color every vertex using its list such that adjacent vertices get different colors. If L(v) = {1, . . . , k} for all v ∈ V then a corresponding list coloring is nothing other than an ordinary k-coloring of G. Assume that W ⊆ V is a...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملChoosability of Squares of K4-minor Free Graphs
Lih, Wang and Zhu [Discrete Math. 269 (2003), 303–309] proved that the chromatic number of the square of a K4-minor free graph with maximum degree ∆ is bounded by ⌊3∆/2⌋+1 if ∆ ≥ 4, and is at most ∆+3 for ∆ ∈ {2, 3}. We show that the same bounds hold for the list chromatic number of squares of K4-minor free graphs. The same result was also proved independently by Hetherington and Woodall.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 157 شماره
صفحات -
تاریخ انتشار 2009